

<HTML>

<HEAD>

<LINK rel="stylesheet" href="../exer.css">

</HEAD>

<BODY>

<H1>

Data Structures, Algorithms, & Applications in C++<BR>

Chapter 11, Exercise 1<BR>

<BR>

</H1>



<em class=var>Ascend</em> can be done in Theta(<em class=var>n</em>)

time because the level 0 chain is in ascending order.

The remaining operations have an expected complexity of

O(<em class=var>log n</em>) time.



</FONT>

</BODY>

</HTML>

